Propositional Quantification
نویسندگان
چکیده
منابع مشابه
Andersonian Deontic Logic, Propositional Quantification, and Mally
We present a new axiomatization of the deontic fragment of Anderson’s relevant deontic logic, give an Andersonian reduction of a relevant version of Mally’s deontic logic previously discussed in this journal, study the effect of adding propositional quantification to Anderson’s system, and discuss the meaning of Anderson’s propositional constant in a wide range of Andersonian deontic systems.
متن کاملPropositional Quantification in the Topological Semantics for S4
Fine and Kripke extended S5, S4, S4.2 and such to produce propositionally quantified systems S5π+, S4π+, S4.2π+: given a Kripke frame, the quantifiers range over all the sets of possible worlds. S5π+ is decidable and, as Fine and Kripke showed, many of the other systems are recursively isomorphic to second-order logic. In the present paper I consider the propositionally quantified system that a...
متن کاملOn the Complexity of Propositional Quantification in Intuitionistic Logic
We define a propositionally quantified intuitionistic logic Her+ by a natural extension of Kripke's semantics for propositional intuitionistic logic. We then show that Har+ is recursively isomorphic to full second order classical logic. Her+ is the intuitionistic analogue of the modal systems S57r+, S47r+, S4.27r+, K47r+, Tir+, K7r+ and Bir+, studied by Fine. ?
متن کاملIntentional Paradoxes and an Inductive Theory of Propositional Quantification
Quantification over propositions is a necessary component of any theory of attitudes capable of providing a semantics of attitude ascriptions and a sophisticated system of reasoning about attitudes. There appear to be two general approaches to propositional quantification. One is developed within a first order quantificational language, the other in the language of higher order logic. The first...
متن کاملA Propositional Proof System with Quantification Over Permutations
We introduce a new propositional proof system, which we call H, that allows quantification over permutations. In H we may write (∃ab)α and (∀ab)α, which is semantically equivalent to α(a, b) ∨ α(b, a) and α(a, b) ∧ α(b, a), respectively. We show that H with cuts restricted to Σ1 formulas (we denote this system H1) simulates efficiently the Hajós calculus (HC) for constructing graphs which are n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Russell: the Journal of Bertrand Russell Studies
سال: 2011
ISSN: 1913-8032,0036-0163
DOI: 10.15173/russell.v31i1.2208